Counting signed vexillary permutations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting involutory, unimodal, and alternating signed permutations

In this work we count the number of involutory, unimodal, and alternating elements of the group of signed permutations Bn, and the group of even-signed permutations Dn. Recurrence relations, generating functions, and explicit formulas of the enumerating sequences are given. © 2006 Elsevier B.V. All rights reserved. MSC: primary: 05A15; secondary: 05A19; 05A05

متن کامل

Pairings and Signed Permutations

Identity (1) is easy to prove: note that the left side is a convolution, so multiply it by xn , sum, and recognize the square of a binomial series. But a combinatorial interpretation of the same identity is not so easy to find. In [3], M. Sved recounts the story of the identity and its combinatorial proofs. She relates how, after she challenged her readers (in a previous article) to find a comb...

متن کامل

Consensus Ranking with Signed Permutations

Signed permutations (also known as the hyperoctahedral group) are used in modeling genome rearrangements. The algorithmic problems they raise are computationally demanding when not NP-hard. This paper presents a tractable algorithm for learning consensus ranking between signed permutations under the inversion distance. This can be extended to estimate a natural class of exponential models over ...

متن کامل

Computing signed permutations of polygons

Given a planar polygon (or chain) with a list of edges {e1, e2, e3, . . . , en−1, en}, we examine the effect of several operations that permute this edge list, resulting in the formation of a new polygon. The main operations that we consider are: reversals which involve inverting the order of a sublist, transpositions which involve interchanging subchains (sublists), and edge-swaps which are a ...

متن کامل

Counting 1324-Avoiding Permutations

We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program provides data for the number of 1324-avoiding permutations of length up to 20.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2020

ISSN: 0196-8858

DOI: 10.1016/j.aam.2020.102106